Eecient Recursive Subtyping
نویسندگان
چکیده
Subtyping in the presence of recursive types for the calculus was studied by Amadio and Cardelli in In that paper they showed that the problem of deciding whether one recursive type is a subtype of another is decidable in exponential time In this paper we give an O n algorithm Our algorithm is based on a simpli cation of the de nition of the subtype relation which allows us to reduce the problem to the emptiness problem for a certain nite automaton with quadratically many states It is known that equality of recursive types and the covariant B ohm order can be decided e ciently by means of nite automata since they are just language equality and language inclusion respectively Our results extend the automata theoretic approach to handle orderings based on contravariance
منابع مشابه
Subtyping Recursive Types in Kernel Fun, Preliminary Draft
The problem of deening and checking a subtype relation between recursive types was studied in AC93] for a rst order type system, but for second order systems, which combine subtyping and parametric polymorphism, only negative results are known Ghe93b]. This paper studies the problem of subtype checking for recursive types in system kernel Fun, a typed-calculus with subtyping and bounded second ...
متن کاملEecient and Flexible Matching of Recursive Types
Equality and subtyping of recursive types have been studied in the 1990s by Amadio and Cardelli; Kozen, Palsberg, and Schwartzbach; Brandt and Henglein; and others. Potential applications include automatic generation of bridge code for multi-language systems and type-based retrieval of software modules from libraries. Auerbach, Barton, and Raghavachari advocate a highly exible combination of ma...
متن کاملSubtyping Recursive Games
Using methods drawn from Game Semantics, we build a sound and computationally adequate model of a simple calculus that includes both subtyping and recursive types. Our model solves recursive type equations up to equality, and is shown to validate a subtyping rule for recursive types proposed by Amadio and Cardelli.
متن کاملEecient Inference of Object Types
Abadi and Cardelli have recently investigated a calculus of objects 2]. The calculus supports a key feature of object-oriented languages: an object can be emulated by another object that has more reened methods. Abadi and Cardelli presented four rst-order type systems for the calculus. The simplest one is based on nite types and no subtyping, and the most powerful one has both recursive types a...
متن کاملA On Subtyping-Relation Completeness, with an Application to Iso-Recursive Types
Well-known techniques exist for proving the soundness of subtyping relations with respect to type safety. However, completeness has not been treated with widely applicable techniques, as far as we’re aware. This paper develops techniques for stating and proving that a subtyping relation is complete with respect to type safety and applies the techniques to the study of iso-recursive subtyping. A...
متن کامل